perm filename BEN[W79,JMC]1 blob sn#421831 filedate 1979-02-27 generic text, type C, neo UTF8
COMMENT āŠ—   VALID 00002 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002	1. A rec fn is complete if it is guaranteed to have just one fixed point.
C00003 ENDMK
CāŠ—;
1. A rec fn is complete if it is guaranteed to have just one fixed point.
How can this be proved?
Can it be proved within the first order formalism?

2. The functionals for the derived functions are not ordinarily extensional
in terms of the original functional.  Are they sometimes?

	a. rationed recursion

	b. ok[tau,w]

3. write compiler that will produce i and r from abstract syntax
of f.